Search results for "Preference satisfaction"

showing 1 items of 1 documents

Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem

2017

The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understand…

Mathematical optimizationWorkforce scheduling021103 operations researchComputer science0211 other engineering and technologiesScheduling (production processes)02 engineering and technologyPreference satisfactionHome healthWorkforce0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingOperational costsHeuristicsProceedings of the 6th International Conference on Operations Research and Enterprise Systems
researchProduct